Reasoning about Actions and Planning with Preferences Using Prioritized Default Theory

This paper shows how action theories, expressed in an extended version of the languageB, can be naturally encoded using Prioritized Default Theory. We also show how prioritizeddefault theory can be extended to express preferences between rules. This extension providesa natural framework to introduce different types of preferences in action theories—preferencesbetween actions and preferences between final states. In particular, we demonstrate how thesepreferences can be expressed within extended prioritized default theory. We also discuss howthis framework can be implemented in terms of answer set programming.